Generating random braids

نویسندگان

Volker Gebhardt

Juan González-Meneses

چکیده

We present an algorithm to generate positive braids of a given length as words in Artin generators with a uniform probability. The complexity of this algorithm is polynomial in the number of strands and in the length of the generated braids. As a byproduct, we describe a finite state automaton accepting the language of lexicographically minimal representatives of positive braids that has the minimal possible number of states, and we prove that its number of states is exponential in the number of strands.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Prototyping Counter Braids on NetFPGA

We recently proposed Counter Braids, an SRAM-only counter architecture for high-speed per-flow counting. Accurate per-flow counting was deemed complex and expensive because of the need for large arrays of counters operating at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amount of SRAM to store both the counters and a flow-to-counter association rule, so that arriv...

متن کامل

On the Genericity of Pseudo-anosov Braids Ii: Conjugations to Rigid Braids

We prove that generic elements of braid groups are pseudo-Anosov, in the following sense: in the Cayley graph of the braid group with n > 3 strands, with respect to Garside’s generating set, we prove that the proportion of pseudo-Anosov braids in the ball of radius l tends to 1 exponentially quickly as l tends to infinity. Moreover, with a similar notion of genericity, we prove that for generic...

متن کامل

Dynamical Systems on Three Manifolds Part I: Knots, Links and Chaos

In this paper, we give an explicit construction of dynamical systems (defined within a solid torus) containing any knot (or link) and arbitrarily knotted chaos. The first is achieved by expressing the knots in terms of braids, defining a system containing the braids and extending periodically to obtain a system naturally defined on a torus and which contains the given knotted trajectories. To g...

متن کامل

A Fast Algorithm to the Conjugacy Problem on Generic Braids Ki Hyoung Ko and Jang

Random braids that are formed by multiplying randomly chosen permutation braids are studied by analyzing their behavior under Garside’s weighted decomposition and cycling. Using this analysis, we propose a polynomial-time algorithm to the conjugacy problem that is successful for random braids in overwhelming probability. As either the braid index or the number of permutation-braid factors incre...

متن کامل